On the Non-Planarity of a Random Subgraph
نویسندگان
چکیده
Let G be a finite graph with minimum degree r. Form a random subgraph Gp of G by taking each edge of G into Gp independently and with probability p. We prove that for any constant ǫ > 0, if p = 1+ǫ r , then Gp is non-planar with probability approaching 1 as r grows. This generalizes classical results on planarity of binomial random graphs. AMS Classification: 05C80, 05C10.
منابع مشابه
Branch-and-Bound Techniques for the Maximum Planar Subgraph Problem
We present branch-and-bound algorithms for nding a maximum planar subgraph of a nonplanar graph. The problem has important applications in circuit layout, automated graph drawing, and facility layout. The algorithms described utilize heuristics to obtain an initial lower bound for the size of a maximum planar subgraph, then apply a sequence of fast preliminary tests for planarity to eliminate i...
متن کاملA Linear Algorithm for Finding a Maximal Planar Subgraph
We construct an optimal linear time algorithm for the maximal planar subgraph problem: given a graph G, nd a planar subgraph G 0 of G such that adding to G 0 any edge of G not present in G 0 leads to a non-planar graph. Our solution is based on a dynamic graph search procedure and a fast data structure for on-line planarity testing of triconnected graphs. Our algorithm can be transformed into a...
متن کاملA Linear-Time Algorithm for Finding a Maximal Planar Subgraph
We construct an optimal linear-time algorithm for the maximal planar subgraph problem: given a graph G, find a planar subgraph G′ of G such that adding to G′ an extra edge of G results in a non-planar graph. Our solution is based on a fast data structure for incremental planarity testing of triconnected graphs and a dynamic graph search procedure. Our algorithm can be transformed into a new opt...
متن کاملA greedy random adaptive search procedure for the weighted maximal planar graph problem
The weighted maximal planar graph (WMPG) problem seeks to find a subgraph from a given weighted complete graph such that the subgraph is planar—it can be embedded on the plane without any arcs intersecting. The subgraph is maximal—no additional arc can be added to the subgraph without destroying its planarity and it also has the maximal sum of arc weights. In this paper, the main objective is t...
متن کاملAn Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm
We describe an implementation of the Hopcroft and Tarjan planarity test and em bedding algorithm The program tests the planarity of the input graph and either constructs a combinatorial embedding if the graph is planar or exhibits a Kuratowski subgraph if the graph is non planar
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 22 شماره
صفحات -
تاریخ انتشار 2013